u TEMPORAL CONSTRAINT SATISFACTION IN MATRIX METHOD
نویسندگان
چکیده
Constraint satisfaction is a challenging problem in Interval Algebra (IA). So there are many efforts to attack this problem. After building a matrix method to deal with temporal reasoning problems, we develop basic techniques for applying the matrix method to constraint satisfaction in this paper. Thus, the propagating rules and the algorithms of 3and path-consistency are studied. If our matrix method is used, then the temporal constraint satisfaction problem can be transformed into a problem that can be effectively solved.
منابع مشابه
Model Formulation: Modeling Electronic Discharge Summaries as a Simple Temporal Constraint Satisfaction Problem
OBJECTIVE To model the temporal information contained in medical narrative reports as a simple temporal constraint satisfaction problem. DESIGN A constraint satisfaction problem is defined by time points and constraints (inequalities between points). A time interval comprises a pair of points and a constraint. Five complete electronic discharge summaries and paragraphs from 226 other discharg...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملSolving Temporal Constraints in Real Time and in a Dynamic Environment
In this paper we will present a study of different resolution techniques for solving Constraint Satisfaction Problems (CSP) in the case of temporal constraints. This later problem is called Temporal Constraint Satisfaction Problem (TCSP). We will mainly focus here on solving TCSPs in real time and in a dynamic environment. Indeed, addressing these two issues is very relevant for many real world...
متن کاملTemporal Constraint Satisfaction
We describe a restriction of Dechter, Meiri and Pearl's TCSPs (Temporal Constraint Satisfaction Problems) suuciently expressive to represent any job shop scheduling problem. A solver based on the restriction is then described, which is similar to Ladkin and Reinefeld's qualitative interval network solver; except, however, that the ltering method used during the search is not path consistencybut...
متن کاملApplying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] for solving large propositional satisfiability (SAT) problems and binary Constraint Satisfaction Problems (CSPs) respectively. Newer SAT techniques, such as the Discrete Langrangian Method (DLM) [10], have significantly ...
متن کامل